On the distribution of de Bruijn sequences of given complexity
نویسندگان
چکیده
The distribution y( c, n) of de Bruijn sequences of order n and linear complexity c is investigated. It is shown that for n > 4, ~(2” 1, n) = 0 (mod@, and for k > 3, ~(2’~ 1,2/c) = 0 (mod16). It is also shown that y(c, n) = 0 (mod4) for all c, and n 3 3 such that cn is even.
منابع مشابه
Clustering of Short Read Sequences for de novo Transcriptome Assembly
Given the importance of transcriptome analysis in various biological studies and considering thevast amount of whole transcriptome sequencing data, it seems necessary to develop analgorithm to assemble transcriptome data. In this study we propose an algorithm fortranscriptome assembly in the absence of a reference genome. First, the contiguous sequencesare generated using de Bruijn graph with d...
متن کاملOn the Distribution of de Bruijn Sequences of Low Complexity
The distribution y(c, n) of de Bruijn sequences of order n and linear complexity c is investigated. Some new results are proved on the distribution of de Bruijn sequences of low complexity, i.e., their complexity is between 2”-’ + n and 2”-‘+2”-2. It is proved that for n>5 and 2”-‘+n 0. It is also proved that ~(2”~’ +2...
متن کاملPermutation Polynomials, de Bruijn Sequences, and Linear Complexity
The paper establishes a connection between the theory of permutation polynomials and the question of whether a de Bruijn sequence over a general finite field of a given linear complexity exists. The connection is used both to construct span 1 de Bruijn sequences (permutations) of a range of linear complexities and to prove non-existence results for arbitrary spans. Upper and lower bounds for th...
متن کاملComputing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence
Let Σ be a finite ordered alphabet. We present polynomialtime algorithms for computing the k-th in the lexicographic order Lyndon word of a given length n over Σ and counting Lyndon words of length n that are smaller than a given word. We also use the connections between Lyndon words and minimal de Bruijn sequences (theorem of Fredricksen and Maiorana) to develop the first polynomial time algor...
متن کاملMinimum Eulerian circuits and minimum de Bruijn sequences
Given a digraph (directed graph) with a labeling on its arcs, we study the problem of finding the Eulerian circuit of lexicographically minimum label. We prove that this problem is NP-complete in general, but if the labelling is locally injective (arcs going out from each vertex have different labels), we prove that it is solvable in linear time by giving an algorithm that constructs this circu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 30 شماره
صفحات -
تاریخ انتشار 1984